On Strongly Chordal Graphs That Are Not Leaf Powers
نویسنده
چکیده
A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V,E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv ∈ E if and only if the distance between u and v in T is at most k. Characterizing leaf powers is a challenging open problem, along with determining the complexity of their recognition. Leaf powers are known to be strongly chordal, but few strongly chordal graphs are known to not be leaf powers, as such graphs are difficult to construct. Recently, Nevries and Rosenke asked if leaf powers could be characterized by strong chordality and a finite set of forbidden induced subgraphs. In this paper, we provide a negative answer to this question, by exhibiting an infinite family G of (minimal) strongly chordal graphs that are not leaf powers. During the process, we establish a connection between leaf powers, alternating cycles and quartet compatibility. We also show that deciding if a chordal graph is G-free is NP-complete.
منابع مشابه
Towards a Characterization of Leaf Powers by Clique Arrangements
The class Lk of k-leaf powers consists of graphs G = (V,E) that have a k-leaf root, that is, a tree T with leaf set V , where xy ∈ E, if and only if the T -distance between x and y is at most k. Structure and linear time recognition algorithms have been found for 2-, 3-, 4-, and, to some extent, 5-leaf powers, and it is known that the union of all k-leaf powers, that is, the graph class L = ⋃∞ ...
متن کاملStrictly chordal graphs are leaf powers
A fundamental problem in computational biology is the phylogeny reconstruction for a set of specific organisms. One of the graph theoretical approaches is to construct a similarity graph on the set of organisms where adjacency indicates evolutionary closeness, and then to reconstruct a phylogeny by computing a tree interconnecting the organisms such that leaves in the tree are labeled by the or...
متن کاملBoxicity of Leaf Powers
The boxicity of a graph G, denoted as box(G) is defined as the minimum integer t such that G is an intersection graph of axisparallel t-dimensional boxes. A graph G is a k-leaf power if there exists a tree T such that the leaves of the tree correspond to the vertices of G and two vertices in G are adjacent if and only if their corresponding leaves in T are at a distance of at most k. Leaf power...
متن کاملSimplicial Powers of Graphs
In a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k ≥ 1, a graph G = (VG, EG) is the k-simplicial power of a graph H = (VH , EH) (H a root graph of G) if VG is the set of all simplicial vertices of H , and for all distinct vertices x and y in VG, xy ∈ EG if and only if the distance inH between x and y is atmost k. This concept generalizes k-leaf powers introduce...
متن کاملOn Leaf Powers
For an integer k, a tree T is a k-leaf root of a finite simple undirected graph G = (V,E) if the set of leaves of T is the vertex set V of G and for any two vertices x, y ∈ V , x 6= y, xy ∈ E if and only if the distance of x and y in T is at most k. Then graph G is a k-leaf power if it has a k-leaf root. G is a leaf power if it is a k-leaf power for some k. This notion was introduced and studie...
متن کامل